package net.projecteuler.problem10;

import net.projecteulrt.util.Prime;

public class SummationOfPrimes {
	
	public long getSummationOfPrimes(long limit) {
		Prime prime = new Prime();
		long summation = 0;
		for(long i = 2L; i < limit; i++) {
			if(prime.isPrime(i)) {
				summation += i;
			}
		}
		return summation;
	}
	
}
